State-Space Traversal Techniques for Planning
نویسندگان
چکیده
Foreword These notes are based on the AI planning lectures at the Albert-Ludwigs-Universität Freiburg. I would like to thank all the students who have participated in the planning course and given comments, pointed out errors, and suggested other improvements, including Slawomir Grzonka,
منابع مشابه
Randomized Backtracking in State Space Traversal
While exhaustive state space traversal is not feasible in reasonable time for complex concurrent programs, many techniques for efficient detection of concurrency errors and testing of concurrent programs have been introduced in recent years, such as directed search and context-bounded model checking. We propose to use depth-first traversal with randomized backtracking, where it is possible to b...
متن کاملPartial Order Reduction in Symbolic State Space Traversal Using ZBDDs
In order to reduce state explosion problem, techniques such as symbolic state space traversal and partial order reduction have been proposed. Combining these two techniques, however, seems difficult, and only a few research projects related to this topic have been reported. In this paper, we propose handling single place zero reachability problem of Petri nets by using both partial order reduct...
متن کاملIncremental Planning with Adaptive Dimensionality
Path planning is often a high-dimensional computationallyexpensive planning problem as it requires reasoning about the kinodynamic constraints of the robot and collisions of the robot with the environment. However, large regions of the environment are typically benign enough that a much faster low-dimensional planning combined with a local path following controller suffice. Planning with Adapti...
متن کاملSleep Sets Meet Duplicate Elimination
The sleep sets technique is a path-dependent pruning method for state space search. In the past, the combination of sleep sets with graph search algorithms that perform duplicate elimination has often shown to be error-prone. In this paper, we provide the theoretical basis for the integration of sleep sets with common search algorithms in AI that perform duplicate elimination. Specifically, we ...
متن کاملThe Causal Graph Revisited for Directed Model Checking
Directed model checking is a well-established technique to tackle the state explosion problem when the aim is to find error states in large systems. In this approach, the state space traversal is guided through a function that estimates the distance to nearest error states. States with lower estimates are preferably expanded during the search. Obviously, the challenge is to develop distance fun...
متن کامل